class Solution{
public:	
	// Function returns the second
	int secondlargest(int arr[], int n){
    int largest = arr[0];
    int slargest = -1;

    for(int i =0; i<n; i++){
        if(arr[i] > largest){
            slargest = largest;
            largest = arr[i];
        }
        else if (arr[i] < largest && arr[i] > slargest){
            slargest = arr[i];
        }
    }
    return slargest;
}

	// largest elements
	int print2largest(int arr[], int n) {
	    // code here
	int slargest = secondlargest(arr, n);
    // int ssmallest = secondsmallest(arr, n);
    return slargest;
	}
};